On decidability of amenability in computable groups
نویسندگان
چکیده
In this paper we extend the approach of M. Cavaleri to effective amenability class computably enumerable groups, i.e. in particular do not assume that groups are finitely generated. case computable also study complexity set all F{\o}lner sequences and paradoxical decomposition. appendix attach a version "On decidability groups" by K. Duda A. Ivanov which covers Sections 9 10 from previous version.
منابع مشابه
On Amenability of Automata Groups
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups (“Mother groups”) which is done by analyzing the asymptotic properties of random walks on these groups.
متن کاملAmenability of Groups Acting on Trees
This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation ∆ = 〈b, t| [b, t]b, [[[b, t], b], b]〉. In the proof, I show that ∆ acts transitively on a 3-regular tree, and that Γ = 〈b, b −1 〉 stabilizes a vertex and acts by r...
متن کاملWeak amenability of Coxeter groups
Let (G,S) be a Coxeter group. We construct a continuation, to the open unit disc, of the unitary representations associated to the positive definite functions g 7→ rl(g). (Here 0 < r < 1, and l denotes the length function with respect to the generating set S.) The constructed representations are uniformly bounded and we prove that this implies the weak amenability of the group G. Résumé Soit (G...
متن کاملWeak Amenability of Hyperbolic Groups
We prove that hyperbolic groups are weakly amenable. This partially extends the result of Cowling and Haagerup showing that lattices in simple Lie groups of real rank one are weakly amenable. We take a combinatorial approach in the spirit of Haagerup and prove that for the word length metric d on a hyperbolic group, the Schur multipliers associated with r have uniformly bounded norms for 0 < r ...
متن کاملComputable Trees, Prime Models, and Relative Decidability
We show that for every computable tree T with no dead ends and all paths computable, and every D >T ∅, there is a D-computable listing of the isolated paths of T . It follows that for every complete decidable theory T such that all the types of T are computable and every D >T ∅, there is a D-decidable prime model of T . This result extends a theorem of Csima and yields a stronger version of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2022
ISSN: ['1432-0665', '0933-5846']
DOI: https://doi.org/10.1007/s00153-022-00819-5